Referring Expressions as Formulas of Description Logic
نویسندگان
چکیده
In this paper, we propose to reinterpret the problem of generating referring expressions (GRE) as the problem of computing a formula in a description logic that is only satisfied by the referent. This view offers a new unifying perspective under which existing GRE algorithms can be compared. We also show that by applying existing algorithms for computing simulation classes in description logic, we can obtain extremely efficient algorithms for relational referring expressions without any danger of running into infinite regress.
منابع مشابه
On Referring Expressions in Query Answering over First Order Knowledge Bases
A referring expression in linguistics is any noun phrase identifying an object in a way that will be useful to interlocutors. In the context of a query over a first order knowledge baseK, constant symbols occurring inK are the artifacts usually used as referring expressions in certain answers to the query. In this paper, we begin to explore how this can be usefully extended by allowing a class ...
متن کاملSingular Referring Expressions in Conjunctive Query Answers: the case for a CFD DL Dialect
A referring expression in linguistics is any noun phrase identifying an object in a way that will be useful to interlocutors. In the context of conjunctive queries over a description logic knowledge base (DL KB), typically constant symbols (usually treated as rigid designators) are used as referring expressions in a certain answer to the query. In this paper, we begin to explore how this can be...
متن کاملThe DLRUS Temporal Description Logic
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear temporal logic with Since and Until. We define a query language (where queries are non-recursive Datalog programs and atoms are complex DLRUS expressions) and investigate the problem of checking query containment under...
متن کاملTemporal Description Logic
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear temporal logic with Since and Until. We define a query language (where queries are non-recursive Datalog programs and atoms are complex DLRUS expressions) and investigate the problem of checking query containment under...
متن کاملA Temporal Description Logic for Reasoning over Conceptual Schemas and Queries
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear temporal logic with Since and Until. The expressive power of the resulting DLRUS logic is illustrated by providing a characterisation of the most important temporal conceptual modelling constructs appeared in the liter...
متن کامل